Adaptive communications system and method

ABSTRACT

An arrangement where a transmitter has multiple transmitting antennas that simultaneously transmit, and where the signals delivered to each transmitting antenna is processed by a space-time transmitter based on the side information that is related to the channel coefficients found between the transmitting antennas and multiple receiving antennas. The receiver&#39;s receiving antennas simultaneously receive the transmitted signals, and the signal from each receiving antenna is processed by the space-time receiver to extract the information symbols that have been transmitted. Alternative systems are possible, such as those employing frequency or code diversity, as well as those employing only one transmit antenna and multiple receive antennas (or visa versa).

CROSS-REFERENCE TO RELATED APPLICATION(S)

[0001] This application claims the benefit of U.S. Provisional Patent Application No. 60/389,347, filed Jun. 5, 2002 (attorney docket number 32150-8001US00).

[0002] This provisional application, together with Disclosure Document No. 496342, entitled “Adaptive Space-Time Transmission,” and received by the Office of Initial Patent Examination on Jul. 2, 2001, are incorporated herein by reference.

BACKGROUND

[0003] Wireless communications services, whatever forms they are in, are provided through radio links, where information such as voice and data is transmitted via modulated electromagnetic waves. Regardless of their forms, all wireless communications systems suffer from adverse propagation effects namely, multipath fading. It is usually caused by the destructive superposition of multipath signals reflected from various types of objects in the propagation environments, creates errors in wireless transmission. One of the common methods used to combat multipath fading is the antenna diversity technique, where two or more antennas at the receiver and/or transmitter are so separated in space or polarization that their fading envelopes are sufficiently decorrelated. A classical combining technique is the maximum-ratio combining (MRC) where the signals from the received antenna elements are weighted such that the signal-to-noise ratio (SNR) of their sum is maximized. However, the MRC technique has so far been used exclusively for receiving applications.

[0004] As there are more and more emerging wireless services, many applications require diversity at the transmitter or at both transmitter and receiver. As a result, various transmit diversity techniques have been proposed. For example, a delay transmit diversity scheme was proposed, where the replicas of the signal are transmitted through multiple antennas at different times, thereby minimizing the correlation of the fading envelope at the receiver. Another approach to transmit diversity was to encode the information symbols with forward error correction codes in both space (i.e., antennas displacement) and in time. Another transmit diversity scheme, commonly referred to as space-time block coding (STBC), also makes use of space and time transmission, where a pair of symbols is transmitted using two antennas at first and the transformed version of the pair is transmitted to obtain the MRC-like diversity. However, these transmit diversity techniques are open-loop systems, where it is assumed that there was no information regarding the propagation channel (commonly referred to as “side information”) available at the transmitter.

[0005] Side information is, however, available to the transmitter in many systems, such as a time division duplex (TDD) system or a system with feedback. When it is available, side information is proven useful. In fact, closed-loop systems have been proposed to incorporate the side information to improve performance. For example, side information was used in determining the transmission weights for a transmit beamformer to a receiver with a single antenna. Another proposed approach employs the maximum ratio transmission (MRT) technique as a generalization of the maximum ratio algorithm for multiple transmitting antennas and multiple receiving antennas where perfect knowledge of the channel states is assumed. The use of side information was also proposed for carrying out eigen-beamforming at the base transmitter in 3GPP WCDMA. All these schemes assumed the availability of accurate side information of the individual transmission paths or the coefficients of the channel matrix. For a feedback system, this requires a considerable amount of feedback bandwidth. For a system with K transmit antennas and L receive antennas, K×L complex channel coefficients (i.e., 2 K×L scalar values) have to be fed back from the receiver to the transmitter.

SUMMARY

[0006] Embodiments of the invention employ an adaptive space-time transmit diversity system using side information. It is a simple but effective transmission method for combating multipath fading using multiple antennas both at the transmitter and receiver, as well as side information. It is efficient in terms of feedback-bandwidth requirements for side information in that the side information to feedback is a scalar value instead of values of a complex channel matrix. In addition, it allows the transmitter to accommodate, without requiring additional signaling protocol, receivers with arbitrary numbers of antennas. The space-time signal set to be transmitted is generated adaptively based on the availability and quality of the side information so that additional gain in SNR can be achieved at the receiver. As explained below, in the case of two transmitting antennas and multiple receiving antennas, the resulting gain at the receiver is $G_{AST} = {{\frac{1}{2\sigma_{h}^{2}}{\sum\limits_{l = 1}^{L}\left( {{h_{1l}}^{2} + {h_{2l}}^{2}} \right)}} + {\frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}{{Re}\left( {v^{*}{\sum\limits_{l = 1}^{L}{h_{1l}h_{2l}^{*}}}} \right)}}}$

[0007] The methods are presented in the context of space and time, but can also be applied to systems that use other diversity techniques, such as space and frequency or space and coding. While systems generally described in detail below employ multiple transmit and receive antennas, alternative systems may employ only one transmit antenna and multiple receive antennas, or visa versa.

BRIEF DESCRIPTION OF THE DRAWINGS

[0008]FIG. 1A is an example of a wireless system with a space-time transmitter, multiple transmitting antennas, multiple receiving antennas and a space-time receiver under a frequency division duplex (FDD) system, while FIG. 1B is an alternative example under a TDD system.

[0009]FIG. 2 is a block diagram of the space-time transmitter of FIG. 1.

[0010]FIG. 3 is a block diagram of the space-time receiver of FIG. 1.

[0011]FIG. 4 is diagram illustrating quantization of phase for side information.

DETAILED DESCRIPTION

[0012] The invention will now be described with respect to various embodiments.

[0013] The following description provides specific details for a thorough understanding of, and enabling description for, these embodiments of the invention. However, one skilled in the art will understand that the invention may be practiced without these details. In other instances, well-known structures and functions have not been shown or described in detail to avoid unnecessarily obscuring the description of the embodiments of the invention.

[0014] The terminology used in the description presented below is intended to be interpreted in its broadest reasonable manner, even though it is being used in conjunction with a detailed description of certain specific embodiments of the invention. Certain terms may even be emphasized below; however, any terminology intended to be interpreted in any restricted manner will be overtly and specifically defined as such in this Detailed Description section.

[0015]FIGS. 1A and 1B (collectively, “FIG. 1”) show an adaptive space-time transmit system having multiple antennas at both the transmitter and receiver. Unless described otherwise below, aspects of the invention may be practiced with conventional systems. Thus, the construction and operation of the various blocks shown in FIG. 1 may be of conventional design, and need not be described in further detail herein to make and use the invention, because such blocks will be understood by those skilled in the relevant art. One skilled in the relevant art can readily make any modifications necessary to the blocks in this and other Figures (or other embodiments) based on the detailed description provided herein.

[0016] Incoming information symbols are transformed into space-time signals by a space-time transmitter 11, which are then transmitted using two antennas across two transmit times (although more than two antennas may be employed). The two transmitted signals can be represented by a 2×2 matrix, $\begin{matrix} {s = \begin{bmatrix} s_{11} & s_{12} \\ s_{21} & s_{22} \end{bmatrix}} & (1) \end{matrix}$

[0017] where the entry s_(km) denotes the signal to be transmitted via antenna k at time m. The transmitted signals are received, via a wireless channel, by L receiving antennas at a space-time receiver 12. The received signals are then processed by the space-time receiver 21 to extract the information symbols. The wireless channel consists of 2×L coefficients, which can conveniently be represented by a matrix, $\begin{matrix} {H = \begin{bmatrix} h_{11} & \ldots & h_{1L} \\ h_{21} & \ldots & h_{2L} \end{bmatrix}} & (2) \end{matrix}$

[0018] where a given entry in the matrix is a complex value with a amplitude and phase (i.e., h_(kl)=a_(kl)e^(jφ) ^(_(kl)) ) and denotes a channel coefficient for the path from antenna k to antenna/with an average power defined as the expectation of the square of its absolute value (i.e., σ_(h) ²=E[|h_(kl)|²]). The channel is assumed to be quasi-static; that is, it remains the same within the two transmission times. The channel may be modeled as multiplicative distortion with respect to the transmitted signals. Thus, the received signals can be represented by an L×2 matrix, $\begin{matrix} {r = {{{H^{T}s} + } = \begin{bmatrix} r_{11} & r_{12} \\ \vdots & \vdots \\ r_{L1} & r_{L2} \end{bmatrix}}} & (3) \end{matrix}$

[0019] where a given entry r_(lm) in the matrix above denotes the received signal via antenna I at time m and N is an L×2 matrix whose entry denotes the spatially independent white Gaussian noise associated with rim; that is, $\begin{matrix} { = \begin{bmatrix} n_{11} & n_{12} \\ \vdots & \vdots \\ n_{L1} & n_{L2} \end{bmatrix}} & (4) \end{matrix}$

[0020] where n_(lm) has a zero mean and a variance of σ_(n) ² for l=1, . . . , L and m=1,2.

[0021] The signals to be transmitted are produced by the space-time transmitter 21 in FIG. 2 with the following format. At time instant t₁, a pair of signals, which is a weighted combination of the two symbols, c₁ and c₂, are transmitted simultaneously via the two antennas, $\begin{matrix} {{s_{11} = \frac{c_{1}}{\sqrt{2}}}{and}} & (5) \\ {s_{21} = {\frac{1}{\sqrt{2}}\left\lbrack {{{v\left( {1 - \lambda} \right)}^{1/2}c_{1}} + {\lambda^{1/2}c_{2}}} \right\rbrack}} & (6) \end{matrix}$

[0022] where v is the weighting coefficient based on the side information delivered from the receiver and the parameter λ (0≦λ≦1) is a distribution coefficient. At t₂, another pair of signals, which is a related version of the previous one, is transmitted simultaneously via the two antennas, $\begin{matrix} {{s_{12} = \frac{c_{2}^{*}}{\sqrt{2}}}{and}} & (7) \\ {s_{22} = {\frac{1}{\sqrt{2}}\left\lbrack {{{- {v\left( {1 - \lambda} \right)}^{1/2}}c_{2}^{*}} + {\lambda^{1/2}c_{1}^{*}}} \right\rbrack}} & (8) \end{matrix}$

[0023] (The symbol “*” represents the complex conjugate of a value.) In this specific structure, the weighting coefficient v in s₂₁ and s₂₂ is applied so that the paired transmitted signals (s₁₁ and S₂₁, or s₁₂ and s₂₂) will be properly aligned in phase when they reach the receiver. The condition |v|²=1 is employed for two reasons. The first is a practical hardware consideration. Under this condition, the variation of the envelopes of both signals can be kept the same (i.e., equal transmit gain). In the case of phase-shift keying (PSK) modulation, which is commonly used in many communications systems, the constant signal envelope allows the use of low-cost power amplifiers with less linearity requirement and hence less power consumption in transmission. The second is a system consideration. By setting |v|²=1, the transmitter needs only the knowledge of the phase value of v. Consequently, the feedback requirement is reduced from 2L complex values to a single real value. In addition, it allows the transmitter to accommodate, without requiring additional signaling protocol, a receiver with an arbitrary number of antennas. The distribution coefficient λ allocates energy between symbols c₁ and c₂ to be transmitted, in accordance with the quality of the side information. As explained in more detail below, such a configuration provides for adaptive space-time transmission to provide for increased gain at the receiver.

[0024] Referring to FIG. 3, an example of the receiver 12 as shown as having a channel estimation block 31 and a vector construction block 32, each of which receives the incoming signals r_(11,), r₁₂ through r₁₁, r₁₂. As explained in greater detail below, the output of the channel estimation block 31 is input to a weight matrix block 33, whose output is multiplied with an output of the vector construction block 32 to reproduce symbols c₁ and c₂. Furthermore, as described below, a side information processor 34 receives output from the channel estimation block 31 and provides a feedback signal to the transmitter (via a frequency different from the reception frequency under the FDD system of FIG. 1A, or at different times from under the reception times under TDD system of FIG. 1B). To estimate the transmitted symbols at the receiver 12, a received signal vector is constructed from the received signals described in equation (3) using the vector constructor 32 as $\begin{matrix} {r^{\prime} = \left\lbrack {r_{11}\quad r_{12}^{*}\quad r_{21}^{*}\quad r_{22}^{*}\quad \ldots \quad r_{L1}^{*}\quad r_{L2}^{*}} \right\rbrack^{T}} & (9) \end{matrix}$

[0025] Furthermore, a weight matrix is constructed using the weight matrix constructor 33, based on the channel information from the channel estimator 31, as follows,

W=[W₁ . . . W_(L)]  (10)

[0026] which consists of L sub-matrices, defined as $\begin{matrix} {W_{l} = \begin{bmatrix} A_{l}^{*} & B_{l} \\ B_{l}^{*} & {- A_{l}} \end{bmatrix}} & (11) \end{matrix}$

[0027] The entries of W, are related by the channel coefficients, as given by

A _(l) =h _(1l) +h ₂₁ v(1−λ)^(1/2)  (12)

[0028] and

B ₁ =h ₂₁λ^(1/2)  (13)

[0029] The estimates of the symbols are determined by simply multiplying W by r′, namely, $\begin{matrix} {{\begin{bmatrix} {\overset{\sim}{c}}_{1} \\ {\overset{\sim}{c}}_{2} \end{bmatrix} = {{W \times r^{\prime}} = {{\sqrt{2}{G\begin{bmatrix} c_{1} \\ c_{2} \end{bmatrix}}} + \eta}}}{where}} & (14) \\ {G = {\frac{1}{2}{\sum\limits_{l = 1}^{L}\left( \left| A_{l} \middle| {}_{2}{+ \left| B_{l} \right|^{2}} \right. \right)}}} & (15) \end{matrix}$

[0030] The effective noise vector η consists of two elements; that is, $\begin{matrix} {\eta = {{W\left\lbrack {n_{11}\quad n_{12}^{*}\quad n_{21}\quad n_{22\quad}^{*}\ldots \quad n_{L1}^{*}\quad n_{L2}^{*}} \right\rbrack}^{T} = \left\lbrack {\eta_{1}\quad \eta_{2}} \right\rbrack^{T}}} & (16) \end{matrix}$

[0031] It can be shown that the variance of η₁ and η₂ can be expressed as $\begin{matrix} {\sigma_{\eta}^{2} = {2G\quad \sigma_{n}^{2}}} & (17) \end{matrix}$

[0032] It follows that the SNR for {tilde over (c)}₁ and {tilde over (c)}₂ is given by $\begin{matrix} {\gamma = {{\gamma_{0}\frac{G}{\sigma_{h}^{2}}} = {\gamma_{0}G_{AST}}}} & (18) \end{matrix}$

[0033] where $\gamma_{0} = \frac{\sigma_{c}^{2}\sigma_{h}^{2}}{\sigma_{n}^{2}}$

[0034] denotes the average SNR measured at a receiver for the case of a single transmit antenna and a single receive antenna (i.e., without diversity) and the normalized gain G_(AST) is given by expanding (15), $\begin{matrix} {G_{AST} = {\underset{\underset{G_{\min}}{}}{\frac{1}{2\sigma_{h}^{2}}{\sum\limits_{l = 1}^{L}\left( \left| h_{1l} \middle| {}_{2}{+ \left| h_{2l} \right|^{2}} \right. \right)}} + \underset{\underset{G_{x}}{}}{\frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}{{Re}\left( {v^{*}{\sum\limits_{l = 1}^{L}{h_{1l}h_{2l}^{*}}}} \right)}}}} & (19) \end{matrix}$

[0035] G_(AST) can be viewed as a gain consisting of two components: minimum gain G_(min) that is achievable without side information feedback, and extra (additional) gain G_(x) using side information. By expressing ${\sum\limits_{l = 1}^{L}{h_{1l}h_{2l}^{*}}} = {Re}^{j\quad \Phi}$

[0036] (i.e., a quantity have a magnitude and phase), and recalling the condition |v|²=1, the extra gain can be expressed in the form of $\begin{matrix} \begin{matrix} {G_{x} = {\frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}R\quad {\cos \left\lbrack {\Phi - {\arg (v)}} \right\rbrack}}} \\ {= {\frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}R\quad \cos \quad ɛ}} \end{matrix} & (20) \end{matrix}$

[0037] where ε represents the discrepancy between the current channel state Φ and the side information arg(v), produced by the side information processor 34, explained below.

[0038] Details on implementing the system follow. Eq. (20) indicates that the magnitude of the extra gain depends on both how accurately the side information, arg(v), represents the current state, which then determines how the distribution coefficient, λ is set. Recall that λ was introduced in the first place for adapting to the quality of the side information. Therefore, it is intrinsically a function of ε. In order to realize a reasonable level of G_(x), the value of λ has to be set in accordance to the characteristics of ε. Various cases for maximizing the gain will now be discussed.

[0039] Consider first the case of perfect side information received at the transmitter. If the side information truly represents the current state (i.e., arg(v)=Φ), G_(x) is maximized by setting λ=0, thereby resulting in the extra gain, G_(x)=R. In this case, this scheme is equivalent to traditional beamforming because at each transmission, the signal set consists of the elements of a symbol multiplied by the weights. Its gain becomes, $\begin{matrix} {G_{AST} = {{\frac{1}{2\sigma_{h}^{2}}{\sum\limits_{l = 1}^{L}\left( \left| h_{1l} \middle| {}_{2}{+ \left| h_{2l} \right|^{2}} \right. \right)}} + {\frac{1}{\sigma_{h}^{2}}{{\sum\limits_{l = 1}^{L}{h_{1l}h_{2l}^{*}}}}}}} & (21) \end{matrix}$

[0040] In the case of L=1, it is interesting to see that the instantaneous SNR, $\begin{matrix} {\gamma = {\frac{\gamma_{0}}{\sigma_{h}^{2}}\left\lbrack {{\frac{1}{2}\left( \left| h_{1l} \middle| {}_{2}{+ \left| h_{2} \right|^{2}} \right. \right)} + {{h_{1}h_{2}^{*}}}} \right\rbrack}} & (22) \end{matrix}$

[0041] is exactly the same as in the case of two-branch equal-gain combining (EGC).

[0042] Consider now the case of no side information received at the transmitter. If there is no side information available at the transmitter, the sinusoidal term in G_(x) can take on any value from −1 to 1 with an equal probability. Since the negative values have adverse impacts on the SNR, one should set λ=1 so that G_(x)=0 to totally eliminate the negative impact. Thus, G_(AST)=G_(min). This corresponds to the case of the STBC. In sum, the space-time signal set to be transmitted is generated adaptively based on the availability and quality of the side information so that additional gain in SNR can be achieved at the receiver where possible, but where the corresponding negative impact is eliminated.

[0043] Consider now a third case with quantized side information. In order to feed back the side information from the receiver to the transmitter, the side information may be quantized. If the quantized version of arg(v) is denoted by t, then

ψ=arg(v)+ε_(q)  (23)

[0044] where ε_(q) denotes the quantization error. In the case of no other errors (i.e., arg(v)=Φ), by setting λ=0 the extra gain becomes $\begin{matrix} {G_{x} = {{\frac{1}{\sigma_{h}^{2}}R\quad {\cos \left\lbrack {\Phi - \Psi} \right\rbrack}} = {\frac{1}{\sigma_{h}^{2}}R\quad \cos \quad ɛ_{q}}}} & (24) \end{matrix}$

[0045] If arg(v) varies from −π to π, the quantization range is (−π, π], which is evenly divided by the number of quantization levels. For example, in a2-bit case shown in FIG. 4, there are four quantization levels. Therefore, each quadrant is represented by a particular level. In the case shown in FIG. 4 where Φ lies in the first quadrant (the shaded area), the maximum quantization error is π/4. In general, for quantization using b bits, the quantization error is bounded by $\left| ɛ_{q} \middle| {\leq {\frac{\pi}{2^{b}}.}} \right.$

[0046] If the quantization error (|ε_(q)|) is uniformly distributed over the range $\left\lbrack {0,\frac{\pi}{2^{b}}} \right\rbrack,$

[0047] it causes the gain to degrade by a factor of $\begin{matrix} {\alpha_{r} = {{E\left\lbrack {\cos \quad ɛ_{q}} \right\rbrack} = {\frac{2^{b}}{\pi}\sin \frac{\pi}{2^{b}}}}} & (25) \end{matrix}$

[0048] where E represents an expected value.

[0049] Consider finally the case of side information received at the transmitter where such information is delayed and corrupted with noise. In many cases, the side information will be outdated and corrupted with noise. The delay is caused due to the feedback latency in a frequency division duplex (FDD) system (FIG. 1A) or a time differences in a TDD system (FIG. 1B). Noise results from, e.g., the process of channel estimation.

[0050] A common method for facilitating channel estimation is through the use of pilots or training symbols. When received, the pilots will be corrupted by channel and receiver noise along with signals that carried information. Assuming that an optimal estimator is used, one can obtain the estimate of the channel coefficients h_(kl) as

{tilde over (h)} _(kl) =h _(kl) +n _(kl)  (26)

[0051] where n_(kl) is a complex Gaussian process representing the noise. Based on the latest channel coefficient estimates, the estimate of the side information is computed at the receiver as $\begin{matrix} {{\overset{\sim}{\Phi}}_{n} = {{\arg \left( {\sum\limits_{l = 1}^{L}\quad {{\overset{\sim}{h}}_{1l}{\overset{\sim}{h}}_{2l}^{*}}} \right)} = {{\arg \left( {{R\quad ^{j\quad \Phi_{n}}} + } \right)} = {\Phi_{n} + \Delta_{n}}}}} & (27) \end{matrix}$

[0052] Having obtained {tilde over (Φ)}_(n), the receiver will need to update or predict the side information for next transmission, {circumflex over (Φ)}_(n+1), based on some particular channel properties. For example, the coefficient of a mobile channel can be modeled as a stationary Gaussian process with an autocorrelation function proportional to the zero-order Bessel function of the first kind with parameters of Doppler frequency. In addition, the constant component of a Ricean propagation channel can also be taken advantage of. In general, one may view the approximation of Φ_(n+1) as an optimal filter problem; that is, Φ_(n+1) can be approximated by a linear function of its past samples, $\begin{matrix} {{\overset{\sim}{\Phi}}_{n + 1} = {{f\left( {{\overset{\sim}{\Phi}}_{n},{\overset{\sim}{\Phi}}_{n - 1},\quad \ldots \quad,{\overset{\sim}{\Phi}}_{n - q + 1}} \right)} = {\Phi_{n + 1} + ɛ_{n}}}} & (28) \end{matrix}$

[0053] where q denotes the correlation length. For a large value of q, ε_(n) follows the Gaussian distribution by virtue of the central limit theorem. After {circumflex over (Φ)}_(n+1) is obtained, it will be sent back to the transmitter for the next transmission. Thus, the extra gain that can be realized at the receiver is $\begin{matrix} {\begin{matrix} {G_{x} = {\frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}R\quad {\cos \left\lbrack {\Phi_{n + 1} - {\hat{\Phi}}_{n + 1}} \right\rbrack}}} \\ {= {\frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}R\quad \cos \quad ɛ_{n}}} \end{matrix}\quad} & (29) \end{matrix}$

[0054] where λ will be set in accordance with the statistical properties of ε_(n), among which the correlation coefficient $\begin{matrix} {\rho = \frac{E\left\lbrack {\Phi_{n + 1}{\hat{\Phi}}_{n + 1}} \right\rbrack}{\sqrt{{E\left\lbrack \Phi_{n + 1}^{2} \right\rbrack}{E\left\lbrack {\hat{\Phi}}_{n + 1}^{2} \right\rbrack}}}} & (30) \end{matrix}$

[0055] and the variance of ε_(n) can be exploited. Two examples are provided below; however, other variants can be used.

[0056] From a statistical point of view, ρ indicates the proportion of Φ_(n+1) that can be attributed to the linear relationship with {circumflex over (Φ)}_()n+1). It can be said that ρ is a quality indicator of the side information: a relatively large value implying high quality side information and a relatively small value implying low quality side information. When the quality is high, the transmitter should emphasize use of the side information, and deemphasize it when its quality is low.

[0057] The first two cases above can be considered as the special ones; that is, perfect side information is available when ρ=1 whereas side information is not available when ρ=0. Therefore, the distribution coefficient λ for energy allocation can be set proportional to ρ. In particular, 1−λ=ρ. It follows that $\begin{matrix} {G_{x} = {\frac{\sqrt{\rho}}{\sigma_{h}^{2}}R\quad \cos \quad \left( ɛ_{n} \right)}} & (31) \end{matrix}$

[0058] As mentioned above, the distribution of the error ε_(n) follows the Gaussian distribution; that is, $\begin{matrix} {{p\left( ɛ_{n} \right)} = {\frac{1}{2\sqrt{\pi}}^{- \frac{ɛ_{n}^{2}}{2\quad \sigma_{ɛ}^{2}}}}} & (32) \end{matrix}$

[0059] where σ_(ε) ² denotes the variance of ε_(n). Noticing that if |ε_(n)|>π/2, G_(x) will be negative, one may set the distribution coefficient A based on the probability P(|ε_(n)|>π/2). In particular, the percentage of energy allocated for beamforming is set equal to the probability P(|ε_(n)|≦π/2); that is, $\begin{matrix} \begin{matrix} {\left( {1 - \lambda} \right)^{1/2} = {P\left( \left| ɛ_{n} \middle| {\leq \frac{\pi}{2}} \right. \right)}} \\ {= {1 - {{erfc}\left( \frac{\pi}{2\sqrt{2}\sigma_{ɛ}} \right)}}} \end{matrix} & (33) \end{matrix}$

[0060] where erfc denotes the complementary error function. It follows that $\begin{matrix} {G_{x} = {\left\lbrack {1 - {{erfc}\left( \frac{\pi}{2\sqrt{2}\sigma_{ɛ}} \right)}} \right\rbrack \frac{R}{\sigma_{h}^{2}}{\cos \left( ɛ_{n} \right)}}} & (34) \end{matrix}$

[0061] In practice, one may simplify ${{erfc}\left( \frac{\pi}{2\sqrt{2}\sigma_{ɛ}} \right)},{{{if}\quad \frac{\pi}{2\sqrt{2}\sigma_{ɛ}}}\operatorname{>>}1},{as}$

$\begin{matrix} {{{erfc}\left( \frac{\pi}{2\sqrt{2}\sigma_{ɛ}} \right)} \approx {\frac{2\sqrt{2}\sigma_{ɛ}}{\pi \sqrt{\pi}}^{- {(\frac{\pi}{2\sqrt{2}\sigma_{ɛ}})}^{2}}}} & (35) \end{matrix}$

[0062] The receiver may use an adaptive filter to predict {circumflex over (Φ)}_(n+1). The type of filter to be used depends on specific applications. For example, one may use a simple averaging filter for a system operating in a Ricean environment. One may use a more sophisticated predictive filter to track {circumflex over (Φ)}_(n+1) such as a Kalman filter if the particular application calls for that.

[0063] Initially, there is no side information available to the transmitter and hence λ is set to one. When the transmitter starts to receive feedback values of {circumflex over (Φ)}_(n+1), it will begin to evaluate the estimate of ρ as $\begin{matrix} {\overset{\sim}{\rho} \approx \frac{\sum\limits_{n = 1}^{N}\quad {{\hat{\Phi}}_{n + 1}{\hat{\Phi}}_{n}}}{\sum\limits_{n = 1}^{N}\quad {\hat{\Phi}}_{n}^{2}}} & (36) \end{matrix}$

[0064] where N denotes the number of samples used for the estimation. As N increases, the estimate will become more accurate, and thus an estimate is derived from historical information. Similarly, the estimate of σ_(ε) can be determined by $\begin{matrix} {{\overset{\sim}{\sigma}}_{ɛ}^{2} \approx {\frac{1}{N - 1}{\sum\limits_{n = 1}^{N}\quad \left( {{\hat{\Phi}}_{n + 1} - {\hat{\Phi}}_{n}} \right)^{2}}}} & (37) \end{matrix}$

[0065] Although the above method is presented in the context of space and time, it can also be applied to systems that use space and other resources, such as frequency and code. For example, in an orthogonal frequency division multiplex (OFDM) system, one may pair up the subcarriers within an OFDM symbol for transmission. In particular, at f₁, s₁₁ and s₁₂ will be transmitted via the two antennas and at f₂, s₂₁ and s₂₂ will be transmitted via the same two antennas. The time index in the derivation in the paper can be replace by the frequency index. That is, time and frequency (or code) are equivalent in terms of applying this method. Whether this method is implemented in space-time, space-frequency, or space-code, the requirement for the channel is that it stays relatively unchanged during two transmission times or within spacing of the paired subcarriers.

[0066] The average SNR can be obtained by evaluating the following expectation; that is, {overscore (γ)}=E[γ]=γ₀E{G_(AST)}=γ₀{overscore (G)}_(AST), where $\begin{matrix} {{\overset{\_}{G}}_{AST} = {L + {\frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}{E\left\lbrack \left| {\sum\limits_{l = 1}^{L}\quad {h_{1l}h_{2l}^{*}}} \right| \right\rbrack}{E\left\lbrack {\cos \quad ɛ} \right\rbrack}}}} & (38) \end{matrix}$

[0067] That is, the average SNR depends on the channel condition. In the case of independent Rayleigh fading and L=1, the gain in the average SNR can be expressed as $\begin{matrix} {{\overset{\_}{G}}_{AST} = {1 + {\frac{\pi}{4}\left( {1 - \lambda} \right)^{1/2}{E\left\lbrack {\cos \quad ɛ} \right\rbrack}}}} & (39) \end{matrix}$

[0068] by using the fact that ${E\left\lbrack \left| {h_{1l}h_{2l}^{*}} \right| \right\rbrack} = {\frac{\pi}{4}{\sigma_{h}^{2}.}}$

[0069] With λ=0 and ε=0, the gain in the average SNR is 2.51 dB, which is supposed to be in the case of EGC. ${{{For}\quad L} \geq 2},{\left. {if}\quad \middle| {\sum\limits_{l = 1}^{L}{h_{1l}h_{2l}^{*}}} \right| = {\sum\limits_{l = 1}^{L}\left| h_{1l} \right|^{2}}}$

[0070] (e.g., H consists of two fully correlated row vectors), the maximum gain in the average SNR can be obtained as $\begin{matrix} {{\overset{\_}{G}}_{AST} = {\left\{ {1 + {\left( {1 - \lambda} \right)^{1/2}{E\left\lbrack {\cos \quad ɛ} \right\rbrack}}} \right\} L}} & \quad \end{matrix}$

[0071] On the other hand, if ${E\left\lbrack \left| {\sum\limits_{l = 1}^{L}\quad {h_{1l}h_{2l}^{*}}} \right| \right\rbrack} = 0$

[0072] 0 (e.g., H consists of two mutually orthogonal row vectors), the minimum gain in the average SNR results as

{overscore (G)}_(AST)=L  (41)

[0073] Therefore, the average SNR is bounded by,

Lγ ₀≦{overscore (γ)}≦{1+(1−λ)^(1/2) E[cos ε]} Lγ ₀  (42)

[0074] A system with binary phase-shift keying (BPSK) modulation is taken as an example to illustrate the error probability P for such a system on the Rayleigh fading channel. The error probability P can be computed by integrating the product of the probability of error conditioned on the channel coefficients, P(γ_(b)), and the probability density function (pdf) of the channel coefficients, p(γ_(b)); that is, $\begin{matrix} {P = {\int_{0}^{\infty}{{P\left( \gamma_{b} \right)}{p\left( \gamma_{b} \right)}\quad {\gamma_{b}}}}} & (43) \end{matrix}$

[0075] where γ_(b) denotes the instantaneous SNR per bit, which is given for BPSK by expanding (18), $\begin{matrix} {\gamma_{b} = {\gamma_{0}\left\lbrack {{\frac{1}{2\sigma_{h}^{2}}{\sum\limits_{l = 1}^{L}\left( \left| \quad h_{1l} \middle| {}_{2}{+ \left| h_{2l}^{*} \right|^{2}} \right. \right)}} + \frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}} \middle| {\sum\limits_{l = 1}^{L}\quad {h_{1l}h_{2l}^{*}}} \middle| {\cos \quad ɛ} \right\rbrack}} & (44) \end{matrix}$

[0076] Finding the exact distribution of γ_(b) is a problem of finding the distribution of the square of a sum of 2L Rayleigh variables and there is apparently no known closed-form solution. However, in the case of L=1, from (22), the instantaneous SNR is identical to that in the EGC case. Therefore, the error probability for EGC is also applicable here, the closed-form of which is given by, $\begin{matrix} {P = {\frac{1}{2}\left( {1 - \sqrt{1 - \left( \frac{1}{\gamma_{0} + 1} \right)^{2}}} \right)}} & (45) \end{matrix}$

[0077] If γ₀>>1, it can be approximated as $\begin{matrix} {P \approx {\frac{1}{4}\gamma_{0}^{- 2}}} & (46) \end{matrix}$

[0078] If one is to compute the probability of error by using (43) and (44), but ignoring the second term on the right hand side in (44), the outcome for γ₀>>1 will show the same formula as for the STBC and MRC; that is

P≈3(4{overscore (γ)})⁻²  (47)

[0079] where $\overset{\_}{\gamma} = {\frac{1}{2}\left( {1 + {\left( {1 - \lambda} \right)^{1/2}\frac{\pi}{4}{E\left\lbrack {\cos \quad ɛ} \right\rbrack}}} \right)\gamma_{0}}$

[0080] in this case (whereas for STBC {overscore (γ)}=γ₀/2 and for MRC, {overscore (γ)}=γ₀). With λ=0 and ε=0, (47) becomes P=0.24γ₀ ⁻², showing that (47) is a very close estimate of (46). It is clear that the second term on the right hand side in (44) has little effect on the derivation of error probability. The main contribution to the error probability by this term is through the average SNR, {overscore (γ)}.

[0081] For L≧2, one may establish from (44) that $\begin{matrix} {\gamma_{b} \geq {\frac{\gamma_{0}}{2\sigma_{h}^{2}}{\sum\limits_{l = 1}^{L}\left( \left| \quad h_{1l} \middle| {}_{2}{+ \left| h_{2l}^{*} \right|^{2}} \right. \right)}}} & (48) \end{matrix}$

[0082] The worst error probability P_(max) is the one evaluated under the equal condition. By expressing the pdf of γ_(b) with a χ²-distributed random variable with 4L degrees of freedom and evaluating (43) with the assumption γ₀>>1, one can obtain $\begin{matrix} {P_{\max} \approx {\left( \frac{1}{4\quad \overset{\_}{\gamma}} \right)^{2L}\frac{\left( {{4L} - 1} \right)!}{{\left( {2L} \right)!}{\left( {{2L} - 1} \right)!}}}} & (49) \end{matrix}$

[0083] In the open literature, the total gain from using multiple antennas is categorized into diversity gain and antenna array gain. The former is realized from the redundancy of multiple copies of the transmitted signal and is analogous to channel coding gain. The antenna array gain is realized from the energy which the receive antennas are able to capture, and is equivalent to the gain in average SNR at the receiver. The array gain can be viewed as a measure of efficiency of a transmission scheme.

[0084] In the STBC case, the beam patterns of the transmitting antennas are mutually orthogonal in time. Since the transmitter assumes no knowledge about the channel between itself and the receiver, the only way is to blast energy in all directions by using orthogonal beams. There is no array gain from the transmission. When side information is available, the orthogonality in beam patterns is no longer necessary or even desired since higher energy-efficient transmission can be achieved. In our case, energy is radiated relatively directive to the receiver, thereby reducing co-channel interference. The beam patterns are not orthogonal in general; that is, the dot product. $\begin{matrix} {{\begin{bmatrix} s_{12} \\ s_{22} \end{bmatrix}^{H}\begin{bmatrix} s_{11} \\ s_{21} \end{bmatrix}} = {{{- 2}\left( {1 - \lambda} \right)c_{1}c_{2}} - {{\lambda \left( {1 - \lambda} \right)}^{1/2}\left( {{v^{*}c_{2}c_{2}} - {v\quad c_{1}c_{1}}} \right)}}} & (50) \end{matrix}$

[0085] does not vanish except for λ=1. However, this does not mean that there will mutual interference between the two symbols c₁ and c₂. Based on (14), it appears that to the receiver, the signal vectors associated with c₁ and c₂ are mutually orthogonal and hence are completely separable.

[0086] Unless the context clearly requires otherwise, throughout the description and the claims, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is to say, in the sense of “including, but not limited to.” Words using the singular or plural number also include the plural or singular number respectively. Additionally, the words “herein,” “above,” “below” and words of similar import, when used in this application, shall refer to this application as a whole and not to any particular portions of this application. When the claims use the word “or” in reference to a list of two or more items, that word covers all of the following interpretations of the word: any of the items in the list, all of the items in the list and any combination of the items in the list.

[0087] The above detailed descriptions of embodiments of the invention are not intended to be exhaustive or to limit the invention to the precise form disclosed above. While specific embodiments of, and examples for, the invention are described above for illustrative purposes, various equivalent modifications are possible within the scope of the invention, as those skilled in the relevant art will recognize. For example, while processes or steps are presented in a given order, alternative embodiments may perform routines having steps in a different order, and some steps may be deleted, moved, added, subdivided, combined, and/or modified. Each of these steps may be implemented in a variety of different ways. Also, while these steps are shown as being performed in series, these steps may instead be performed in parallel, or may be performed at different times.

[0088] The teachings of the invention provided herein can be applied to other systems, not necessarily the system described herein. Aspects of the invention described herein may be stored or distributed on computer or machine-readable media, including magnetic and optically readable and removable computer disks, hard-wired or preprogrammed in chips (e.g., EEPROM or other semiconductor chips), as well as distributed electronically over the Internet or over other networks (including wireless networks). These and other changes can be made to the invention in light of the detailed description. The elements and acts of the various embodiments described above can be combined to provide further embodiments.

[0089] All of the above patents and applications and other references, including any that may be listed in accompanying filing papers, are incorporated herein by reference. Aspects of the invention can be modified, if necessary, to employ the systems, functions and concepts of the various references described above to provide yet further embodiments of the invention.

[0090] These and other changes can be made to the invention in light of the above detailed description. While the above description details certain embodiments of the invention and describes the best mode contemplated, no matter how detailed the above appears in text, the invention can be practiced in many ways. Details of the communication scheme may vary considerably in its implementation details, while still be encompassed by the invention disclosed herein. As noted above, particular terminology used when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to any specific characteristics, features or aspects of the invention with which that terminology is associated. In general, the terms used in the following claims should not be construed to limit the invention to the specific embodiments disclosed in the specification, unless the above Detailed Description section explicitly defines such terms. Accordingly, the actual scope of the invention encompasses not only the disclosed embodiments, but also all equivalent ways of practicing or implementing the invention under the claims.

[0091] While certain aspects of the invention are presented below in certain claim forms, the inventors contemplate the various aspects of the invention in any number of claim forms. For example, while only one aspect of the invention is recited as embodied in a computer-readable medium, other aspects may likewise be embodied in a computer-readable medium. Accordingly, the inventors reserve the right to add additional claims after filing the application to pursue such additional claim forms for other aspects of the invention. 

I/We claim:
 1. A communication system, comprising: a space-time transmitter having multiple transmitting antennas and a space-time encoder, wherein each of the transmitting antennas transmits signals over at least one wireless channel, wherein the transmitted signals represent space-time encoded information symbols; a space-time receiver having multiple receiving antennas configured to receive the transmitted signals over the wireless channel, wherein a received signal from each receiving antenna is processed by the space-time receiver to extract the information symbols that have been transmitted; wherein the space-time receiver is configured to determine at least information related to channel coefficients corresponding to a quality of the wireless channel and to provide, over a feedback channel to the space-time transmitter, a channel information signal representing the channel coefficient information; and wherein the space-time encoder is configured to adaptively construct a space-time signal set for transmission based on the information symbols delivered to each transmitting antenna and based on an availability and quality of the channel coefficient information received from the space-time receiver over the feedback channel to enhance a signal to noise ratio obtained at the space-time receiver.
 2. The communication system of claim 1 wherein the transmitted signals have a form of: $s = \begin{bmatrix} s_{11} & s_{12} \\ s_{21} & s_{22} \end{bmatrix}$

where entry s_(km) denotes the signal to be transmitted via one of first and second transmit antennas k at one of first and second adjacent time instances, and wherein at the first time instant, signals s₁₁ and s₂₁ are simultaneously transmitted via respective first and second antennas, wherein $\begin{matrix} {{s_{11} = \frac{c_{1}}{\sqrt{2}}}\quad} \\ {{and}\quad} \\ {\quad {s_{21} = {\frac{1}{\sqrt{2}}\left\lbrack {{{v\left( {1 - \lambda} \right)}^{1/2}c_{1}} + {\lambda^{1/2}c_{2}}} \right\rbrack}}\quad} \end{matrix}$

wherein c₁ and c₂ represent first and second input symbols, wherein v is a weighting coefficient based on a phase value of the channel coefficient information received from the receiver, and |v|²=1, wherein λ is a distribution coefficient, and wherein the distribution coefficient λ is less than or equal to 1 and allocates energy between symbols c₁ and c₂ to be transmitted in accordance with a quality of the received channel coefficient information; and wherein at the second time instance, signals s₁₂ and s₂₂ are simultaneously transmitted via the respective first and second antennas, wherein, ${s_{12} = {- \frac{c_{2}^{*}}{\sqrt{2}}}}\quad$ and $s_{22} = {\frac{1}{\sqrt{2}}\left\lbrack {{{- {v\left( {1 - \lambda} \right)}^{1/2}}c_{2}^{*}} + {\lambda^{1/2}c_{1}^{*}}} \right\rbrack}$

wherein * represents a complex conjugate of a value, and the weighting coefficient v in s₂₁ and s₂₂ is applied so that the paired transmitted signals (s₁₁ and s₂₁, or s₁₂ and s₂₂) are aligned in phase for the space-time receiver.
 3. The communication system of claim 1 wherein an added gain G_(x) of the transmitted signals received by the space-time receiver, as provided by the received channel coefficient information, is: $\begin{matrix} {G_{x} = {\frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}R\quad {\cos \left\lbrack {\Phi - {\arg (v)}} \right\rbrack}}} \\ {= {\frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}R\quad \cos \quad ɛ}} \end{matrix}\quad$

wherein ε represents a discrepancy between a current channel state Φ and received side information arg(v), where arg(v) is a phase of the side information, λ is a distribution coefficient, R is a magnitude of wireless channel coefficients, and σ_(h) ² is an average power of the wireless channel.
 4. A communication method, comprising: receiving side information from a receiver; and encoding information signals for wireless transmission based on the received side information, wherein the encoding is based on space diversity and at least one other diversity, wherein the one other diversity is time diversity, frequency diversity or coding diversity.
 5. The communication method of claim 4, further comprising: receiving the side information via a time division duplex (TDD) communication system.
 6. The communication method of claim 4, further comprising: receiving the side information via a frequency division duplex (FDD) communication system.
 7. The communication method of claim 4, further comprising: receiving the side information via a communication system having a wired or wireless feedback link from the receiver to the space-time transmitter.
 8. The communication method of claim 4 wherein the encoding is based on space and time diversity.
 9. The communication method of claim 4 wherein the encoding is based on space and frequency diversity.
 10. The communication method of claim 4 wherein the encoding is based on space and coding diversity.
 11. The communication method of claim 4 wherein the receiver has multiple receive antennas, and wherein the side information is a single scalar value regardless of a number of the receive antennas.
 12. The communication method of claim 4, further comprising: determining an availability and quality of the received side information; and adaptively encoding the information signals based on the determined availability and quality of the received side information.
 13. The communication method of claim 4 wherein the encoded information signals have a form of: $s = \begin{bmatrix} s_{11} & s_{12} \\ s_{21} & s_{22} \end{bmatrix}$

where entry s_(km) denotes the signal to be transmitted via one of first and second transmit antennas k at one of first and second adjacent time instances, and wherein at the first time instant, signals s₁₁ and s₂₁ are simultaneously transmitted via respective first and second antennas, wherein $\begin{matrix} {{s_{11} = \frac{c_{1}}{\sqrt{2}}}\quad} \\ {{and}\quad} \\ {\quad {s_{21} = {\frac{1}{\sqrt{2}}\left\lbrack {{{v\left( {1 - \lambda} \right)}^{1/2}c_{1}} + {\lambda^{1/2}c_{2}}} \right\rbrack}}\quad} \end{matrix}$

wherein c₁ and c₂ represent first and second input symbols, v is a weighting coefficient based on the side information received from the receiver, and λ is a distribution coefficient, and wherein the distribution coefficient λ allocates energy between symbols c₁ and c₂ to be transmitted, in accordance with a quality of the received side information; and wherein at the second time instance, signals s₁₂ and s₂₂ are simultaneously transmitted via the respective first and second antennas, wherein, ${s_{12} = {- \frac{c_{2}^{*}}{\sqrt{2}}}}\quad$ and $s_{22} = {\frac{1}{\sqrt{2}}\left\lbrack {{{- {v\left( {1 - \lambda} \right)}^{1/2}}c_{2}^{*}} + {\lambda^{1/2}c_{1}^{*}}} \right\rbrack}$

wherein * represents a complex conjugate of a value, and the weighting coefficient v in s₂₁ and s₂₂ is applied so that the paired transmitted signals (s₁₁ and s₂₁, or s₁₂ and s₂₂) are aligned in phase for the receiver.
 14. The communication method of claim 4 wherein |v|²=1.
 15. The communication method of claim 4 wherein the encoded information signals have a form of: $s = \begin{bmatrix} s_{11} & s_{12} \\ s_{21} & s_{22} \end{bmatrix}$

wherein entry s_(km) denotes the signal to be transmitted via one of two transmit antennas k at one of two time values m, and the encoded information signals represent a weighted combination of one of two input symbols, c₁ and c₂.
 16. The communication method of claim 4 wherein an added gain G_(x) of the encoded information signals received by the receiver, as provided by the received side information, is: $\begin{matrix} {G_{x} = {\frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}R\quad {\cos \left\lbrack {\Phi - {\arg (v)}} \right\rbrack}}} \\ {= {\frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}R\quad \cos \quad ɛ}} \end{matrix}\quad$

wherein ε represents a discrepancy between a current channel state Φ and received side information arg(v), arg(v) is a phase of the side information, λ is a distribution coefficient, and σ_(h) ² is an average power of the channel.
 17. The communication method of claim 4, further comprising: at the receiver, determining an approximation of a next channel state {circumflex over (Φ)}_(n+1) from a true next channel state Φ_(n+1) under a linear function of past channel state samples as: {circumflex over (Φ)}_(n+1) =f({tilde over (Φ)}_(n), {tilde over (Φ)}_(n−1), . . . {tilde over (Φ)}_(n−q+1))=Φ_(n+1)+ε_(n) wherein q is a correlation length, ε_(n) is an error that follows a Gaussian distribution, and $\rho = \frac{E\left\lbrack {\Phi_{n + 1}{\hat{\Phi}}_{n + 1}} \right\rbrack}{\sqrt{{E\left\lbrack \Phi_{n + 1}^{2} \right\rbrack}{E\left\lbrack {\hat{\Phi}}_{n + 1}^{2} \right\rbrack}}}$

wherein ρ indicates a proportion of Φ_(n+1) that can be attributed to a linear relationship with {circumflex over (Φ)}_(n+1).
 18. The communication method of claim 4, further comprising: at the receiver, determining an approximation of a next channel state Φ_(n+1) under a linear function of past channel state samples.
 19. A communication system, comprising: means for receiving encoded signals over at least one wireless channel, wherein the means for receiving include: means for determining side information of the wireless channel; and means for transmitting the determined side information to a transmitter, wherein the encoded signals are encoded under space diversity and at least one other diversity, wherein the one other diversity is time diversity, frequency diversity or coding diversity.
 20. The communication system of claim 19, further comprising multiple receiver antenna means, and wherein the side information is a single real value regardless of a number of the receiver antennas.
 21. The communication system of claim 19 wherein the transmitter employs multiple transmit antennas, and wherein the other diversity is frequency diversity.
 22. The communication system of claim 19, further comprising multiple receiver antenna means, wherein the transmitter employs multiple transmit antennas, and wherein the other diversity is coding diversity.
 23. A machine-readable medium whose contents cause at least one transmitter system to perform a communication method, the communication method comprising: at a wireless transmitter, receiving side information from a wireless receiver regarding a wireless channel; and encoding information symbols for transmission based on the determined side information, where the encoding includes adaptively allocating energy between symbols to be transmitted in accordance with a quality of the received side information, and wherein encoding the information symbols for transmission includes encoding the information symbols for space diversity and at least one other diversity, wherein the one other diversity is time diversity, frequency diversity or coding diversity.
 24. The machine-readable medium of claim 23 wherein an added gain G_(AST) of the encoded information signals received by the receiver is: $G_{AST} = {{\frac{1}{2\sigma_{h}^{2}}{\sum\limits_{l = 1}^{L}\quad \left( \left| h_{1l}^{2} \middle| {}_{2}{+ \left| h_{2l}^{2} \right|^{2}} \right. \right)}} + {\frac{\left( {1 - \lambda} \right)^{1/2}}{\sigma_{h}^{2}}{{Re}\left( {v^{*}{\sum\limits_{l = 1}^{L}{h_{1l}h_{2l}^{*}}}} \right)}}}$

wherein h_(k.I), represent conditions of the wireless channel, v is a weighting coefficient based on the side information, λ is a distribution coefficient, and σ_(h) ² is an average power of the wireless channel.
 25. The machine-readable medium of claim 23 wherein encoding the information signals includes constructing at least: $s = \begin{bmatrix} s_{11} & s_{12} \\ s_{21} & s_{22} \end{bmatrix}$

wherein entry s_(km) denotes a signal to be transmitted via at least one of two transmit antennas k with respect to at least one of two time or frequency values m, and represent a weighted combination of at least one of two input symbols, c₁ and c₂.
 26. The machine-readable medium of claim 23, further comprising: determining an approximation of a next channel state under a linear function of past channel state samples.
 27. The machine-readable medium of claim 23 wherein the side information is a single scalar value regardless of a number of receive antennas.
 28. The machine-readable medium of claim 23 wherein the machine-readable medium is a logical node in a network receiving the contents.
 29. The machine-readable medium of claim 23 wherein the machine-readable medium is a data transmission medium carrying a generated data signal containing the contents.
 30. The machine-readable medium of claim 23 wherein the machine-readable medium is a memory of a telecommunication system.
 31. The machine-readable medium of claim 23 wherein the machine-readable medium is a semiconductor memory.
 32. The machine-readable medium of claim 23 wherein the machine-readable medium is a machine-readable disk.
 33. A communication apparatus for use with a wireless receiver, comprising: multiple transmit antennas for transmitting data over at least one wireless channel; and a wireless transmitter coupled to the wireless transmit antennas, wherein the wireless transmitter is configured to receive feedback information from the wireless receiver regarding a condition of the wireless channel; and wherein the wireless transmitter is further configured to encode incoming information symbols for transmission based on the received feedback information, including adaptively allocating energy between symbols to be transmitted in accordance with a quality of the received feedback information, and wherein the encoding of the information symbols for transmission includes encoding the information symbols for space diversity and at least one other diversity, wherein the one other diversity is time diversity, frequency diversity or coding diversity.
 34. The communication apparatus of claim 33, further comprising: a receiver coupled to the wireless transmitter and configured to receive the feedback information under a time division duplex (TDD) scheme.
 35. The communication apparatus of claim 33, further comprising: a receiver coupled to the wireless transmitter and configured to receive the feedback information under a frequency division duplex (FDD) scheme.
 36. The communication apparatus of claim 33, further comprising: a wired or wireless feedback link from the wireless receiver for the feedback information.
 37. The communication apparatus of claim 33 wherein the other diversity is time diversity.
 38. The communication apparatus of claim 33 wherein the other diversity is frequency diversity.
 39. The communication apparatus of claim 33 wherein the other diversity is coding diversity.
 40. The communication apparatus of claim 33 wherein the receiver has multiple receive antennas, and wherein the feedback information is a single scalar value regardless of a number of the receive antennas.
 41. A communication apparatus for use with a wireless transmitter, the apparatus comprising: a receiver configured to receive encoded signals from the wireless transmitter over at least one wireless channel, wherein the receiver includes: a channel estimator configured to estimate side information with respect to the wireless channel; a side information processor coupled to the channel estimator and configured to generate signals regarding the estimated side information, and wherein the side information processor is further configured to provide the generated signals to the wireless transmitter; and an information processor coupled to receive the encoded signals and determine transmitted information from the encoded signals, wherein the encoded signals are encoded under space diversity and at least one other diversity, wherein the one other diversity is time diversity, frequency diversity or coding diversity.
 42. The communication apparatus of claim 41, further comprising: a wired or wireless feedback link coupled to the side information processor for providing the generated signals.
 43. The communication apparatus of claim 41, further comprising: multiple receive antennas coupled to the channel estimator and the symbol processor, wherein the side information is a single scalar value regardless of a number of the receive antennas.
 44. The communication apparatus of claim 41 wherein the information processor includes: a vector constructor coupled to receive the encoded signals; and a weight matrix processor coupled to the vector constructor and the channel estimator. 